A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows

Abstract In this paper, we propose a vehicle routing problem with time windows (TWVRP). problem, consider hard constraint that the fleet can only serve customers within specific window. To solve hybrid ant colony (HACO) algorithm is proposed based on and mutation operation. The HACO has three innovations: first to update pheromones new method; second introduction of adaptive parameters; third add A famous Solomon instance used evaluate performance algorithm. Experimental results show effective against solving windows. Besides, also practical implications for it applicable in problems.